An interval space reducing method for constrained problems with particle swarm optimization

نویسندگان

  • T. M. Machado-Coelho
  • Alexei Manso Corrêa Machado
  • Luc Jaulin
  • Petr Ekel
  • Witold Pedrycz
  • Gustavo Luís Soares
چکیده

In this paper, we propose a method for solving constrained optimization problems using Interval Analysis combined with Particle Swarm Optimization. A Set Inverter Via Interval Analysis algorithm is used to handle constraints in order to reduce constrained optimization to quasi unconstrained one. The algorithm is useful in the detection of empty search spaces, preventing useless executions of the optimization process. To improve computational efficiency, a Space Cleaning algorithm is used to remove solutions that are certainly not optimal. As a result, the search space becomes smaller at each step of the optimization procedure. After completing pre-processing, a modified Particle Swarm Optimization algorithm is applied to the reduced search space to find the global optimum. The efficiency of the proposed approach is demonstrated through comprehensive experimentation involving 100,000 runs on a set of wellknown benchmark constrained engineering design problems. The computational efficiency of the new method is quantified by comparing its results with other PSO variants found in the literature.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

HYBRID PARTICLE SWARM OPTIMIZATION, GRID SEARCH METHOD AND UNIVARIATE METHOD TO OPTIMALLY DESIGN STEEL FRAME STRUCTURES

This paper combines particle swarm optimization, grid search method and univariate method as a general optimization approach for any type of problems emphasizing on optimum design of steel frame structures. The new algorithm is denoted as the GSU-PSO. This method attempts to decrease the search space and only searches the space near the optimum point. To achieve this aim, the whole search space...

متن کامل

CONSTRAINED BIG BANG-BIG CRUNCH ALGORITHM FOR OPTIMAL SOLUTION OF LARGE SCALE RESERVOIR OPERATION PROBLEM

A constrained version of the Big Bang-Big Crunch algorithm for the efficient solution of the optimal reservoir operation problems is proposed in this paper. Big Bang-Big Crunch (BB-BC) algorithm is a new meta-heuristic population-based algorithm that relies on one of the theories of the evolution of universe namely, the Big Bang and Big Crunch theory. An improved formulation of the algorithm na...

متن کامل

Particle Swarm Optimization for Hydraulic Analysis of Water Distribution Systems

The analysis of flow in water-distribution networks with several pumps by the Content Model may be turned into a non-convex optimization uncertain problem with multiple solutions. Newton-based methods such as GGA are not able to capture a global optimum in these situations. On the other hand, evolutionary methods designed to use the population of individuals may find a global solution even for ...

متن کامل

A New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems

Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...

متن کامل

Implementation of Digital Pheromones in Particle Swarm Optimization for Constrained Optimization Problems

This paper presents a model for digital pheromone implementation of Particle Swarm Optimization (PSO) to solve constrained optimization problems. Digital pheromones are models simulating real pheromones produced by insects for communication to indicate a source of food or a nesting location. When integrated within PSO, this principle of communication and organization between swarm members offer...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Appl. Soft Comput.

دوره 59  شماره 

صفحات  -

تاریخ انتشار 2017